- vehicle routing
- problem komiwojażera
English-Polish dictionary of Electronics and Computer Science. 2013.
vehicle routing
Look at other dictionaries:
Vehicle routing problem — The vehicle routing problem (VRP) is a combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. Proposed by Dantzig and Ramser in 1959, VRP is an important problem in the… … Wikipedia
Routing in delay tolerant networking — concerns itself with theability to transport, or route, data from a source to adestination is a fundamental ability all communication networks musthave. Delay and disruption tolerant networks(DTNs), arecharacterized by their lack of connectivity … Wikipedia
Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… … Wikipedia
Vehicle tracking system — A vehicle tracking system combines the installation of an electronic device in a vehicle, or fleet of vehicles, with purpose designed computer software at least at one operational base to enable the owner or a third party to track the vehicle s… … Wikipedia
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
Computer-controlled Vehicle System — The Computer controlled Vehicle System, almost universally referred to as CVS, was a personal rapid transit (PRT) system developed by a Japanese industrial consortium during the 1970s. Like most PRT systems under design at the same time, CVS was… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Harmony search — (HS) is a metaheuristic algorithm (also known as soft computing algorithm or evolutionary algorithm) mimicking the improvisation process of musicians. In the process, each musician plays a note for finding a best harmony all together. Likewise,… … Wikipedia
Concorde TSP Solver — For other uses, see Concorde (disambiguation). The Concorde TSP Solver is a program for solving the traveling salesman problem. It was written by David Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook, in ANSI C, and is freely… … Wikipedia
Problème de tournées de véhicules — Figure illustrant un problème de tournées de véhicules avec un dépot central. Le problème de tournées de véhicules est une classe de problèmes de recherche opérationnelle et d optimisation combinatoire. Il s agit de déterminer les tournées d une… … Wikipédia en Français
Botenproblem — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein… … Deutsch Wikipedia
